Inference Under Convex Cone Alternatives for Correlated Data
نویسنده
چکیده
This paper develops inferential theory for hypothesis testing under general convex cone alternatives for correlated data. Often, interest lies in detecting order among treatment effects, while simultaneously modeling relationships with regression parameters. Incorporating shape or order restrictions in the modeling framework improves the efficiency of statistical methods. While there exists extensive theory for hypothesis testing under smooth cone alternatives with independent observations, extension to correlated data under general convex cone alternatives remains an open problem. This problem is addressed by establishing that a generalized quasi-score statistic is asymptotically equivalent to the squared length of the projection of the standard Gaussian vector onto the convex cone. It is shown that the asymptotic null distribution of this test statistic is a weighted chi-squared distribution, where the weights are mixed volumes of the convex cone and its polar cone. Explicit expressions for these weights are derived via the Hotelling-Weyl-Naiman volume-of-tube formula around a convex manifold in the unit sphere. Furthermore, an asymptotic lower bound for the power of the generalized quasi-score test under a sequence of local alternatives in the convex cone is established. Applications to testing for order restricted alternatives in correlated data and testing for a monotone regression function are discussed.
منابع مشابه
ON THE POWER FUNCTION OF THE LRT AGAINST ONE-SIDED AND TWO-SIDED ALTERNATIVES IN BIVARIATE NORMAL DISTRIBUTION
This paper addresses the problem of testing simple hypotheses about the mean of a bivariate normal distribution with identity covariance matrix against restricted alternatives. The LRTs and their power functions for such types of hypotheses are derived. Furthermore, through some elementary calculus, it is shown that the power function of the LRT satisfies certain monotonicity and symmetry p...
متن کاملGlobal convergence of an inexact interior-point method for convex quadratic symmetric cone programming
In this paper, we propose a feasible interior-point method for convex quadratic programming over symmetric cones. The proposed algorithm relaxes the accuracy requirements in the solution of the Newton equation system, by using an inexact Newton direction. Furthermore, we obtain an acceptable level of error in the inexact algorithm on convex quadratic symmetric cone programmin...
متن کاملAn Algorithm for Quadratic Programming with Applications in Statistics
Problems involving estimation and inference under linear inequality constraints arise often in statistical modeling. In this paper we propose an algorithm to solve the quadratic programming problem of minimizing ψ(θ) = θ′Qθ−2c′θ for positive-definite Q, where θ is constrained to be in a closed polyhedral convex cone C = {θ : Aθ ≥ d}, and the m×n matrix A is not necessarily full row-rank. The th...
متن کاملInference for Eigenvalues and Eigenvectors of Gaussian Symmetric Matrices
This article presents maximum likelihood estimators (MLEs) and log-likelihood ratio (LLR) tests for the eigenvalues and eigenvectors of Gaussian random symmetric matrices of arbitrary dimension, where the observations are independent repeated samples from one or two populations. These inference problems are relevant in the analysis of diffusion tensor imaging data and polarized cosmic backgroun...
متن کاملInference for Eigenvalues and Eigenvectors of Gaussian Symmetric Matrices By
This article presents maximum likelihood estimators (MLEs) and loglikelihood ratio (LLR) tests for the eigenvalues and eigenvectors of Gaussian random symmetric matrices of arbitrary dimension, where the observations are independent repeated samples from one or two populations. These inference problems are relevant in the analysis of diffusion tensor imaging data and polarized cosmic background...
متن کامل